Federated learning has recently been applied to recommendation systems to protect user privacy. In federated learning settings, recommendation systems can train recommendation models only collecting the intermediate parameters instead of the real user data, which greatly enhances the user privacy. Beside, federated recommendation systems enable to collaborate with other data platforms to improve recommended model performance while meeting the regulation and privacy constraints. However, federated recommendation systems faces many new challenges such as privacy, security, heterogeneity and communication costs. While significant research has been conducted in these areas, gaps in the surveying literature still exist. In this survey, we-(1) summarize some common privacy mechanisms used in federated recommendation systems and discuss the advantages and limitations of each mechanism; (2) review some robust aggregation strategies and several novel attacks against security; (3) summarize some approaches to address heterogeneity and communication costs problems; (4)introduce some open source platforms that can be used to build federated recommendation systems; (5) present some prospective research directions in the future. This survey can guide researchers and practitioners understand the research progress in these areas.

Ramp merging is a typical application of cooperative intelligent transportation system (C-ITS). Vehicle trajectories perceived by roadside sensors are importation complement to the limited visual field of on-board perception. Vehicle tracking and trajectory denoising algorithm is proposed in this paper to take full advantage of roadside cameras for vehicle trajectory and speed profile estimation. Dynamic speed guidance algorithm is proposed to help on-ramp vehicles to merge into mainline smoothly, even in non-cooperative environment where mainline vehicles are not expected to slow down to accommodate on-ramp vehicles. On-site experiments were taken out in a merging area of Hangzhou Belt Highway to testify our prototype system, and simulation analysis shows our proposed algorithm can achieve significant fuel savings during the ramp merging process.

Morality in dialogue systems has raised great attention in research recently. A moral dialogue system could better connect users and enhance conversation engagement by gaining users' trust. In this paper, we propose a framework, MoralDial to train and evaluate moral dialogue systems. In our framework, we first explore the communication mechanisms of morality and resolve expressed morality into four sub-modules. The sub-modules indicate the roadmap for building a moral dialogue system. Based on that, we design a simple yet effective method: constructing moral discussions from Rules of Thumb (RoTs) between simulated specific users and the dialogue system. The constructed discussion consists of expressing, explaining, and revising the moral views in dialogue exchanges, which makes conversational models learn morality well in a natural manner. Furthermore, we propose a novel evaluation method in the framework. We evaluate the multiple aspects of morality by judging the relation between dialogue responses and RoTs in discussions, where the multifaceted nature of morality is particularly considered. Automatic and manual experiments demonstrate that our framework is promising to train and evaluate moral dialogue systems.

Accurate polyp segmentation is of great importance for colorectal cancer diagnosis and treatment. However, due to the high cost of producing accurate mask annotations, existing polyp segmentation methods suffer from severe data shortage and impaired model generalization. Reversely, coarse polyp bounding box annotations are more accessible. Thus, in this paper, we propose a boosted BoxPolyp model to make full use of both accurate mask and extra coarse box annotations. In practice, box annotations are applied to alleviate the over-fitting issue of previous polyp segmentation models, which generate fine-grained polyp area through the iterative boosted segmentation model. To achieve this goal, a fusion filter sampling (FFS) module is firstly proposed to generate pixel-wise pseudo labels from box annotations with less noise, leading to significant performance improvements. Besides, considering the appearance consistency of the same polyp, an image consistency (IC) loss is designed. Such IC loss explicitly narrows the distance between features extracted by two different networks, which improves the robustness of the model. Note that our BoxPolyp is a plug-and-play model, which can be merged into any appealing backbone. Quantitative and qualitative experimental results on five challenging benchmarks confirm that our proposed model outperforms previous state-of-the-art methods by a large margin.

Existing knowledge graph (KG) embedding models have primarily focused on static KGs. However, real-world KGs do not remain static, but rather evolve and grow in tandem with the development of KG applications. Consequently, new facts and previously unseen entities and relations continually emerge, necessitating an embedding model that can quickly learn and transfer new knowledge through growth. Motivated by this, we delve into an expanding field of KG embedding in this paper, i.e., lifelong KG embedding. We consider knowledge transfer and retention of the learning on growing snapshots of a KG without having to learn embeddings from scratch. The proposed model includes a masked KG autoencoder for embedding learning and update, with an embedding transfer strategy to inject the learned knowledge into the new entity and relation embeddings, and an embedding regularization method to avoid catastrophic forgetting. To investigate the impacts of different aspects of KG growth, we construct four datasets to evaluate the performance of lifelong KG embedding. Experimental results show that the proposed model outperforms the state-of-the-art inductive and lifelong embedding baselines.

Multimodal Machine Translation (MMT) focuses on enhancing text-only translation with visual features, which has attracted considerable attention from both natural language processing and computer vision communities. Recent advances still struggle to train a separate model for each language pair, which is costly and unaffordable when the number of languages increases in the real world. In other words, the multilingual multimodal machine translation (Multilingual MMT) task has not been investigated, which aims to handle the aforementioned issues by providing a shared semantic space for multiple languages. Besides, the image modality has no language boundaries, which is superior to bridging the semantic gap between languages. To this end, we first propose the Multilingual MMT task by establishing two new Multilingual MMT benchmark datasets covering seven languages. Then, an effective baseline LVP-M3 using visual prompts is proposed to support translations between different languages, which includes three stages (token encoding, language-aware visual prompt generation, and language translation). Extensive experimental results on our constructed benchmark datasets demonstrate the effectiveness of LVP-M3 method for Multilingual MMT.

近年来，由渠道状态信息（CSI）启用了基于WiFi的智能人类传感技术（CSI）。但是，在不同的环境中部署时，基于CSI的传感系统会遭受性能降解。现有作品通过使用新环境中的大量未标记的高质量数据来通过域的适应来解决这一问题，这在实践中通常不可用。在本文中，我们提出了一种新颖的增强环境不变的鲁棒wifi wifi识别系统，名为Airfi，该系统从新的角度涉及环境依赖问题。 Airfi是一个新颖的领域泛化框架，无论环境如何，都可以学习CSI的关键部分，并将模型推广到看不见的场景，不需要收集任何数据以适应新环境。 Airfi从几个培训环境环境中提取了共同的功能，并最大程度地减少了它们之间的分布差异。该功能将进一步增强，以使环境更强大。此外，可以通过几次学习技术进一步改进该系统。与最先进的方法相比，Airfi能够在不同的环境环境中工作，而无需从新环境中获取任何CSI数据。实验结果表明，我们的系统在新环境中保持强大，并优于比较系统。

通用的完整交叉点Calabi-yau歧管（GCICY）是最近建立的卡拉比（Calabi-Yau）歧管的新结构。但是，使用标准代数方法的新GCICY产生非常费力。由于这种复杂性，GCICYS及其分类的数量仍然未知。在本文中，我们尝试使用神经网络在这个方向上取得一些进展。结果表明，我们训练有素的型号可以对文献中现有类型的$（1,1）$（1,1）$（1,1）$（1,1）$（2,1）$ GCICYS具有很高的精度。此外，他们可以在预测新的GCICY方面获得$ 97 \％$的精度，这与用于培训和测试的产品不同。这表明机器学习可能是分类和生成新GCICE的有效方法。

本文提出了一种轻巧，有效的校准神经网络模型，用于降低低成本微电力系统（MEMS）陀螺仪，并实时估算机器人的态度。关键思想是从惯性测量单元（IMU）测量的时间窗口中提取本地和全局特征，以动态地回归陀螺仪的输出补偿组件。遵循精心推导的数学校准模型，LGC-NET利用深度可分离的卷积捕获截面特征并减少网络模型参数。较大的内核注意力旨在更好地学习远程依赖性和特征表示。在EUROC和TUM-VI数据集中评估了所提出的算法，并在具有更轻巧模型结构的（看不见的）测试序列上实现了最先进的测试。尽管它不采用视觉传感器，但与我们的LGC-NET的估计取向与排名最高的视觉惯性探针系统相当。我们在：https：//github.com/huazai665/lgc-net上进行开源方法

多年来，旨在从已知事实中推断出新结论的知识图（KGS）的推理主要集中在静态KG上。现实生活中知识的不断增长提出了使能够扩大KGS的归纳推理能力的必要性。现有的归纳工作假设新实体都在批处理中一次出现，这过度简化了新实体不断出现的实际情况。这项研究探讨了一个更现实，更具挑战性的环境，新实体分为多批次。我们提出了一个基于步行的归纳推理模型来解决新环境。具体而言，具有自适应关系聚合的图形卷积网络旨在使用其邻近关系编码和更新实体。为了捕捉不同的邻居的重要性，我们在聚合过程中采用了一种查询反馈注意机制。此外，为了减轻新实体的稀疏链接问题，我们提出了一种链接增强策略，以将可信赖的事实添加到KGS中。我们构建了三个新数据集，用于模拟此多批次出现方案。实验结果表明，我们所提出的模型优于基于最先进的基于嵌入的，基于步行的基于步行和基于规则的模型。